home *** CD-ROM | disk | FTP | other *** search
- Frequently Asked Questions (FAQS);faqs.142
-
-
-
- aicom mcvax!swivax!otten@uunet.uu.net International Usenet AI news
-
- Of the above newsgroups, the following have FAQ postings:
- comp.ai, comp.robotics, comp.speech, comp.neural-nets,
- comp.lang.lisp, comp.lang.scheme, comp.lang.clos, comp.lang.prolog
-
- German AI newsgroups:
- de.sci.ki
- de.sci.ki.announce
- de.sci.ki.mod-ki
- de.sci.ki.discussion
-
-
- AI Research in a particular country:
-
- British AI alvey jws%ib.rl.ac.uk@nsfnet-relay.ac.uk
- Japanese AI fj-ai%etl.jp@relay.cs.net
- German AI mod-ki%unido.irb@unido.bitnet
- Mexican AI IAMEX-L on listserv@tecmtyvm.mty.itesm.mx
-
- The IAMEX-L list is administrated by the AI Invetigation Center in
- Instituto Tecnologico y de Estudios Superiores de Monterrey (ITESM)
- in Monterrey, N.L. To be added to that list, please contact:
- pl500368@tecmtyvm.bitnet (Juana Maria Gomez Puertos)
- pl157961@tecmtyvm.bitnet (Fernando Careaga Sanchez)
-
- The newsgroup de.sci.ki.discussion is the German equivalent of comp.ai.
- The newsgroup de.sci.ki.announce is for announcements about AI. The
- newsgroup de.sci.ki.mod-ki is moderated by Hans-Werner Hein
- <hein@damon.irf.uni-dortmund.de>.
-
- The newsgroup aus.ai is the (unmoderated) Australian equivalent of comp.ai.
-
- AIIA (Artificial Intelligence Italian Association)
- c/o Fondazione Ugo Borboni, Roma - Italy
- Contact: Oliviero Stock <stock@irst.it>
- Tel: +39 6 54803428
- Fax: +39 6 54804405
-
- Artificial Life:
- alife@cognet.ucla.edu
-
- The alife mailing list is for communications regarding artificial
- life, a formative interdisciplinary field involving computer science,
- the natural sciences, mathematics, medicine and others. Send mail to
- alife-request@cognet.ucla.edu to be added to the list.
-
- See also UCLA Artificial Life Depository in question [3-0].
-
- AI applications to Human-Computer interface design:
- AI-CHI <wiley!ai-chi@lll-lcc.llnl.gov>
-
- All requests to be added to or deleted from this list, problems, questions,
- etc., should be sent to wiley!ai-chi-request@LLL-LCC.LLNL.GOV.
-
-
- AI in Education:
- ai-ed@sun.com (was ai-ed@sumex-aim.stanford.edu)
-
- Includes ICAI (intelligent computer aided instruction) and
- ITS (intelligent tutoring systems).
-
- All requests to be added to or deleted from this list, problems, questions,
- etc., should be sent to ai-ed-request@sun.com.
-
-
- Artificial Intelligence and Law:
- ail-l@austin.onu.edu
-
- To subscribe to AIL-L you should send a message to the internet address
- listserv@austin.onu.edu
- The body of the message should consist of:
- subscribe AIL-L <your full name>
-
-
- AI in Medicine:
- ai-medicine@med.stanford.edu
-
- Focus is on computer-based medical decision support.
-
- All requests to be added to or deleted from this list, problems, questions,
- etc., should be sent to ai-medicine-request@med.stanford.edu
-
-
- AI for Development:
- An occasional newsletter for folk interested in AI applications in
- and for developing countries. The newsletter is sent to the mailing
- list and to the newsgroup comp.society.development.
-
- Send requests to be added to the mailing list to Kathleen King
- <kk@aisb.ed.ac.uk>.
-
-
- Cellular Automata:
- cellular-automata@think.com (aka ca@think.com)
-
- Gatewayed to the newsgroup comp.theory.cell-automata.
-
- Archived messages may be found at ftp.think.com in the files:
- mail/ca.archive*
-
- All other requests to be added to or deleted from this list, problems,
- questions, etc., should be sent to cellular-automata-request@think.com.
-
-
- Classification and clustering:
- class-l%sbccvm.bitnet@cunyvm.cuny.edu
-
- To subscribe to CLASS-L you should send a message to the internet address
- listserv%sbccvm.bitnet@cunyvm.cuny.edu
- The body of the message should consist of:
- subscribe CLASS-L <your full name>
- To have your name removed from the CLASS-L subscriber list, send:
- signoff CLASS-L
-
-
- Connectionism and Neural Networks:
-
- Connectionism:
- connectionists@cs.cmu.edu
-
- All requests to be added to or deleted from this list, problems,
- questions, etc., should be sent to connectionists-request@cs.cmu.edu.
-
- Neural Networks (moderated):
- Neuron@cattell.psych.upenn.edu
-
- Neuron-Digest is a moderated list (in digest form) dealing with all
- aspects of neural networks (and any type of network or neuromorphic
- system). Topics include both connectionist models (artificial neural
- networks) and biological systems ("wetware"). The digest is posted to
- comp.ai.neural-nets.
-
- All requests to be added to or deleted from this list, problems,
- questions, etc., should be sent to neuron-request@cattell.psych.upenn.edu
-
- Neuron Digest archives are kept in the OSU Neuroprose collection
- and in cattell.psych.upenn.edu:/pub/Neuron-Digest
-
- Users of the Rochester Connectionist Simulator:
- simulator-users@cs.rochester.edu
- simulator-bugs@cs.rochester.edu
-
- All requests to be added to or deleted from this list, problems,
- questions, etc., should be sent to simulator-request@cs.rochester.edu.
-
- The simulator is available in cs.rochester.edu:/pub/simulator
-
-
- Distributed AI Mailing Lists:
-
- DAI-List: send requests to DAI-List-request@mcc.com
-
- MAAMAW Blackboard (Modeling Autonomous Agents in a
- Multi-Agent World): send requests to
- demazeau@lifia.imag.fr
-
-
- Intelligent systems for Economics digest (IE-digest):
- IE-list@cs.ucl.ac.uk
-
- The IE-digest aims to act as a forum to exchange ideas on using
- `intelligent' techniques to model economic and financial systems.
- Calls for papers, paper announcements and queries are welcome.
-
- Techniques which were originally developed to model psychological and
- biological processes are now receiving considerable attention as tools
- for modelling and understanding economic and financial processes.
- These techniques, which include neural networks, genetic algorithms
- and expert systems are now being used in a wide variety of
- applications including the modelling of economic cycles, modelling of
- artificial economies, portfolio optimisation and credit evaluation.
-
- To be added to the list, send mail to IE-list-request@cs.ucl.ac.uk. An
- archive of back issues of the digest, as well as papers,
- bibliographies and software, may be obtained by anonymous ftp from
- cs.ucl.ac.uk:ie (128.16.5.31).
-
- List moderated by Suran Goonatilake, Dept. of Computer Science,
- University College London, Gower St., London WC1E 6BT, UK,
- <surang@cs.ucl.ac.uk>.
-
-
- Expert Systems in Agriculture:
- ag-exp-l%ndsuvm1.bitnet@cunyvm.cuny.edu
-
- To subscribe to ag-exp-l you should send a message to the internet address
- listserv%ndsuvm1.bitnet@cunyvm.cuny.edu
- The body of the message should consist of:
- subscribe AG-EXP-L <your full name>
-
-
- Use of computers in the Fine Arts:
- fineart%ecs.umass.edu@relay.cs.net
-
- The FINEART Forum is dedicated to International collaboration between
- artists and scientists. It is subsidized by the International Society for
- the Arts, Science, and Technology (ISAST), 2020 Milvia, Berkeley, CA 94704.
-
- The purpose of this bulletin board is to disseminate information regarding
- the use of computers in the Fine Arts. One of the general areas of
- interest is Art & AI.
-
-
- Genetic Algorithms:
-
- GA-List@AIC.NRL.NAVY.MIL (moderated)
-
- Send subscription requests to the -request form of the list
- or to gref@aic.nrl.navy.mil.
-
- Past copies of the digest are archieved on ftp.aic.nrl.navy.mil
- in the /pub/galist directory. Some software is also archived there.
-
-
- Discussion of GAs also appears from time to time in
- comp.ai.neural-nets and comp.theory.self-org-sys.
-
-
- Knowledge Acquisition:
-
- kaw@swi.psy.uva.nl
-
- KAW is a list server provided by the University of Amsterdam for
- the knowledge acquisition community. It will carry news and
- discussion relating to KA activities.
-
- To join the list, mail a message 'subscribe' to
- kaw-request@swi.psy.uva.nl.
-
-
- Logic Programming, Prolog:
-
- Prolog and Logic Programming:
- prolog@sushi.stanford.edu (general)
- prolog-hackers@sushi.stanford.edu (nitty gritty)
-
- All requests to be added to or deleted from this list, problems,
- questions, etc., should be sent to prolog-request@sushi.stanford.edu
-
- Concurrent Logic Programming:
- clp.x@xerox.com
-
- All requests to be added to or deleted from this list, problems,
- questions, etc., should be sent to clp-request.x@xerox.com or to
- Jacob Levy <jlevy.pa@xerox.com>.
-
-
- Machine Learning:
-
- ml@ics.uci.edu
-
- The Machine Learning List is moderated. Contributions should be
- relevant to the scientific study of machine learning. Mail requests
- to be added or deleted to ml-request@ics.uci.edu.
-
- Back issues may be FTP'd from ics.uci.edu in pub/ml-list/V<X>/<N> or
- N.Z where X and N are the volume and number of the issue; ID:
- anonymous PASSWORD: <your mail address>
-
-
- Natural Language Processing:
-
- Information Retrieval:
- irlist <ir-l%uccvma.bitnet@vm1.nodak.edu>
-
- To subscribe send the following command to LISTSERV@UCCVMA.BITNET:
- SUB IR-L your_full_name
- where "your_full_name" is your real name, not your login Id.
- Non-BitNet users can join by sending the above command as the only
- line in the text/body of a message to
- LISTSERV%UCCVMA.BITNET@VM1.NODAK.EDU.
-
- Moderator: IRLUR%UCCMVSA.BITNET@VM1.NODAK.EDU
-
- Natural Language and Knowledge Representation (moderated):
- nl-kr@cs.rpi.edu (formerly nl-kr@cs.rochester.edu)
- Gatewayed to the newsgroup comp.ai.nlang-know-rep.
-
- BITNET subscribers: we now have a LISTSERVer for nl-kr.
- You may send submissions to NL-KR@RPIECS
- and any listserv-style administrative requests to LISTSERV@RPIECS.
-
- Back issues are available from host archive.cs.rpi.edu [128.213.10.18]
- in the files nl-kr/Vxx/Nyy (ie nl-kr/V01/N01 for V1#1), mail requests
- will not be promptly satisfied. If you can't reach `cs.rpi.edu' you
- may want to use `turing.cs.rpi.edu' instead.
-
- All requests to be added to or deleted from this list, problems,
- questions, etc., should be sent to nl-kr-request@cs.rpi.edu.
-
- Natural Language Generation:
- siggen@cs.rpi.edu
-
- Speech Interfaces:
-
- Electronic Communal Temporal Lobe (or ECTL) is a moderated mailing list
- for speech interface enthusiats. To subscribe, send a message with your
- name, institution, department, daytime phone and an email address to
- ectl-request@snowhite.cis.uoguelph.ca. If you have trouble with this mail
- address, call David Leip at (519) 824-4120 ext.3709.
-
- ECTL has an anonymous ftp archive which is located at
- snowhite.cis.uoguelph.ca [131.104.48.1] in /pub/ectl. Included in the
- archive are: all issues of ECTL, as well as a list of subscribers, lists
- of speech related products (s/w & h/w),and a list of speech related
- technical report abstracts. If you would like to contribute to the
- archive, please mail: ectl-sub@snowhite.cis.uoguelph.ca If you need
- information about how to ftp, or such things, please send mail to:
- ectl-request@snoehite.cis.uoguelph.ca
-
-
- Prosody:
-
- To subscribe, send a one-line message to listserv@purccvm.bitnet
- in the following format:
-
- subscribe prosody <Your Full Name>
-
-
- Translation and Interpretation of Natural Language:
- lantra-l%finhutc.bitnet@cunyvm.cuny.edu
-
- To add or remove yourself from the list, send a message to
- listserv%finhutc.bitnet@cunyvm.cuny.edu. The sender of the message
- you send must be the name (E-mail address) you want to add or remove
- from the list. The text body of the message should be:
- SUBSCRIBE LANTRA-L your_full_name
- or:
- SIGNOFF LANTRA-L
- where your_full_name is your normal name, not your E-mail address.
-
- Text Analysis and Natural Language Applications:
- SCHOLAR%CUNYVM.BITNET@uga.cc.uga.edu
-
- SCHOLAR is an online information service covering all aspects of
- natural language processing in such fields as literary studies,
- linguistics, history and lexicography. It consists of information like
- book reviews, project reports database listings, a conference
- calendar, and news of hardware and software relevant to the field.
- SCHOLAR is distributed occasionally as the quantity of information
- received allows. Contributions should be sent to Joseph Raben
- <jqrqc@cunyvm.cuny.edu>.
-
- To add or remove yourself from the list, send a message to
- listserv@cunyvm.cuny.edu. The sender of the message
- you send must be the name (E-mail address) you want to add or remove
- from the list. The text body of the message should be:
- SUBSCRIBE SCHOLAR your_full_name
- or:
- SIGNOFF SCHOLAR
- where your_full_name is your normal name, not your E-mail address.
- For technical assistance, send mail to <lnaqc@cunyvm.cuny.edu>.
-
- SCHOLAR files are available by anonymous ftp from jhuvm.hcf.jhu.edu
- (128.220.2.2). Use username scholar and type your login userid as a
- password. The index of SCHOLAR files is index.scholar. The files are
- also available by listserv. For an explanation of the coding system
- for items in SCHOLAR, send mail to <listserv@cunyvm.cuny.edu> with the
- following as the body of the message:
- Get SCHOLAR COD
- To retrieve the entire release send mail to <listserv@cunyvm.cuny.edu>
- with the folowing as the body of the message:
- Get AZ Package
-
-
- Neural Networks:
- See Connectionism.
-
-
- Simulated Annealing:
- Contact: anneal-request@cs.ucla.edu (Daniel R. Greening)
-
- This mailing list is for discussion of simulated annealing techniques,
- analysis, and related issues such as stochastic optimization,
- Boltzmann machines, and metricity of NP-complete move spaces.
-
- Membership in this list is restricted to those doing active research
- in simulated annealing or related areas. The list itself is
- unmoderated.
-
-
- Simulation:
- simulation@ufl.edu
- Gatewayed to the newsgroup comp.simulation.
-
- All requests to be added to or deleted from this list, problems, questions,
- etc., should be sent to simulation-request@ufl.edu.
-
-
- Symbolic Math:
- Symbolic Math <leff%smu.uucp@UUNET.UU.NET>
- Gatewayed to the newsgroup sci.math.symbolic.
-
- Mailing list covering symbolic math algorithms, applications and problems
- relating to the various symbolic math languages.
-
- Mail to be forwarded to the list should be sent to
- leff%smu.uucp@uunet.uu.net (ARPANET/MilNet) or sci.math.symbolic (USENET).
- Requests to be included on the list should be sent to
- leff%smu.uucp@uunet.uu.net.
-
-
- AI Vision Research:
-
- vision-list@ads.com
- All requests to be added to or deleted from this list, problems, questions,
- etc., should be sent to vision-list-request@ads.com.
-
- cvnet%yorkvm1.bitnet@cunyvm.cuny.edu
- Color and vision research.
-
- ----------------------------------------------------------------
- Subject: [1-3] Dial-up AI-related bulletin board systems
-
- The primary AI-related dial-up bulletin board systems are:
-
- The Interocitor 214-258-1832 (Fido 1:124/2206) V.32bis (14.4kbps)
- SysOp: Steve Rainwater Hours: 24
- Desc: AI CD-ROM submission site, general AI archive.
-
- ShadeTree BBS 412-244-9416 (Fido 1:129/124) V.22bis (2400bps)
- SysOp: Bill Keller Hours: 8:30pm-8:30am only
- Desc: Oriented toward beginners in the field.
-
- C.N.S. BBS 509-62706267 (Fido 1:347/303) USR HST (9600bps)
- SysOp: Wesley Elsberry Hours: 24
- Desc: Best source for neural network related information.
-
- Fuzzy Logic Related BBS's:
-
- Aptronix FuzzyNet 408-428-1883 N/8/1 1200-19,200 baud
-
- The Turning Point 512-219-7828 N/8/1 DS/HST 1200-19,200 baud (LIBRARY)
- 512-219-7848 N/8/1 DS/HST 1200-19,200 buad
-
- Motorola FREEBBS 512-891-3733 E/7/1 1200-9600 baud
-
- ----------------------------------------------------------------
- Subject: [1-4] What are the rules for the game of "Life"?
-
- Cellular Automata, of which Life is an example, were suggested by
- Stanislaw Ulam in the 1940s, and first formalized by von Neumann.
- Conway's "Game of Life" was popularized in Martin Gardner's
- mathematical games column in the October 1970 and February 1971 issues
- of Scientific American. (Shorter notes on life are alse given in the
- column in each month from October 1970 to April 1971, and well as
- November 1971, January 1972, and December 1972.)
-
- The rules for the game of life are quite simple. The game board is a
- rectangular cell array, with each cell either empty or filled. At each
- tick of the clock, we generate the next generation by the following rules:
-
- if a cell is empty, fill it if 3 of its neighbors are filled
- (otherwise leave it empty)
-
- if a cell is filled, it
- dies of loneliness if it has 1 or fewer neighbors
- continues to live if it has 2 or 3 neighbors
- dies of overcrowding if it has more than 3 neighbors
-
- Neighbors include the cells on the diagonals. Some implementations use
- a torus-based array (edges joined top-to-bottom and left-to-right) for
- computing neighbors.
-
- For example, a row of 3 filled cells will become a column of 3 filled
- cells in the next generation. The R pentomino is an interesting
- pattern:
- xx
- xx
- x
- Try it with other patterns of 5 cells initially occupied. If you
- record the ages of cells, and map the ages to colors, you can get a
- variety of beautiful images.
-
- When implementing Life, be sure to maintain separate arrays for the
- old and new generation. Updating the array in place will not work
- correctly.
- ----------------------------------------------------------------
- Subject: [1-5] What AI competitions exist?
-
- The Loebner Prize, based on a fund of over $100,000 established by New
- York businessman Hugh G. Loebner, is awarded annually for the computer
- program that best emulates natural human behavior. During the
- contest, a panel of independent judges attempts to determine whether
- the responses on a computer terminal are being produced by a computer
- or a person, along the lines of the Turing Test. The designers of the
- best program each year win a cash award and a medal. If a program
- passes the test in all its particulars, then the entire fund will be
- paid to the program's designer and the fund abolished. For further
- information about the Loebner Prize, write Dr. Robert Epstein,
- Executive Director, Cambridge Center for Behavioral Studies, 11
- Waterhouse Street, Cambridge, MA 02138, or call 617-491-9020.
-
- The BEAM Robot Olympics is a robot exhibition/competition started in
- 1991. For more information about the competition, write to BEAM Robot
- Olympics, c/o: Mark W. Tilden, MFCF, University of Waterloo, Ontario,
- Canada, N2L-3G1, 519-885-1211 x2454, mwtilden@watmath.uwaterloo.ca.
-
- ----------------------------------------------------------------
- Subject: [1-6] Where can I get a machine readable dictionary, thesaurus, and
- other text corpora?
-
- Free:
-
- Roget's 1911 Thesaurus is available by anonymous FTP from the
- Consortium for Lexical Research (clr.nmsu.edu, [128.123.1.12]).
- The pathname is /pub/lexica/thesauri/roget-1911.
-
- Project Gutenberg also has Roget's 1911 Thesaurus. For more
- information, write to Michael S. Hart, Professor of Electronic Text,
- Executive Director of Project Gutenberg Etext, Illinois Benedictine
- College, Lisle, IL 60532 or send email to hart@vmd.cso.uiuc.edu.
-
- For people without FTP, Austin Code Works sells floppy disks
- containing Roget's 1911 Thesaurus for $40.00. This money helps support
- the production of other useful texts, such as the 1913 Webster's dictionary.
-
- The Open Book Initiative maintains a text repository on world.std.com
- (a public access UNIX system, 617-739-WRLD). For more information,
- send email to obi@world.std.com, write to Software Tool & Die, 1330
- Beacon Street, Brookline, MA 02146, or call 617-739-0202.
-
- The CHILDES project at Carnegie Mellon University has a lot of data of
- children speaking to adults, as well as the adult written and adult
- spoken corpora from the CORNELL project. Contact Brian MacWhinney
- <brian@andrew.cmu.edu> for more information.
-
- The Association for Computational Linguistics (ACL) has a Data
- Collection Initiative. For more information, contact Donald Walker at
- Bellcore, walker@flash.bellcore.com.
-
- Two lists of common female first names (4967 names) and male first
- names (2924 names) are available for anonymous ftp from ftp.cs.cmu.edu
- in the directory /afs/cs.cmu.edu/user/mkant/Public/Corpii/Names/. Read
- the file README first. [Note that you must cd to this directory in one
- atomic operation, as superior directories are protected during an
- anonymous ftp.] Send mail to mkant@cs.cmu.edu for more information.
-
- Commercial:
-
- Illumind publishes the Moby Thesaurus (25,000 roots/1.2 million
- synonyms), Moby Words (560,000 entries), Moby Hyphenator (155,000
- entries), and the Moby Part-of-Speech (214,000 entries) and Moby
- Pronunciator (167,000 entries) lexical databases. All databases are
- supplied in pure ASCII, royalty-free, in both Macintosh and MS-DOS
- disk formats (also in .Z file formats). Both commercial (to resell
- derived structures as part of commercial applications) and
- educational/research licenses are available. For more information,
- write to Illumind, Attn: Grady Ward, 3449 Martha Court, Arcata,
- CA 95521, call 707-826-7715, or send email to grady@btr.com.
-
- The Oxford Text Archive has hundreds of online texts in a wide variety
- of languages, including a few dictionaries (the OED, Collins, etc.).
- The Lancaster-Oslo-Bergen (LOB), Brown, and London-Lund corpii are also
- available from them. For more information, write to Oxford Electronic
- Publishing, Oxford University Press, 200 Madison Avenue, New York, NY
- 10016, call 212-889-0206, or send mail to archive@vax.oxford.ac.uk.
- (Their contact information in England is Oxford Text Archive, Oxford
- University Computing Service, 13 Banbury Road, Oxford OX2 6NN, UK, +44
- (865) 273238.)
-
- ----------------------------------------------------------------
- Subject: [1-7] List of Smalltalk implementations.
-
- Little Smalltalk -- Tim Budd's version of Smalltalk
- cs.orst.edu: /pub/budd/small.v3.tar
-
- GNU Smalltalk
- prep.ai.mit.edu:/pub/gnu/smalltalk-1.1.1.tar.Z
-
- ----------------------------------------------------------------
- Subject: [1-8] Commercial AI products.
-
- See the Robotics FAQ for information on Robotics manufacturers.
-
- GBB, generic blackboard framework: provides:
- -- A high-performance blackboard database compiler and
- runtime library, which support pattern-based, multidimensional
- range-searching algorithms for efficient proximity-based retrieval
- of blackboard objects
- -- KS representation languages
- -- Generic control shells and agenda-management utilities
- -- Interactive, graphic displays for monitoring and examining
- blackboard and control components
- These components provide the infrastructure needed to build
- blackboard-based applications. GBB is available for DOS/Windows, Mac,
- Unix workstations (Sun, HP/Apollo, IBM, DEC, Silicon Graphics),
- Symbolics and TI Explorer Lisp machines. (GBB is a significantly enhanced,
- commercial version of the UMass GBB research framework, available via
- FTP as described in FAQ, part 3.) NetGBB, distributed extension to
- GBB: provides to GBB the communication and coordination facilities
- needed to build heterogenous distributed blackboard applications.
- For more information write to Blackboard Technology Group, Inc., 401 Main
- Street, Amherst, MA 01002, call 413-256-8990, or fax 413-256-3179. To
- be added to the mailing lists, send mail to gbb-user-request@bn.cs.umass.edu.
- There are two mailing lists, gbb-user (moderated) and gbb-users (unmoderated).
-
-
- RAL (Rule-extended Algorithmic Language) is a C-based RETE (OPS83)
- implementation that allows one to seamlessly add rules and objects to
- C programs. It runs on Apollo, Sony News, AT&T 3B series, Aviion,
- DecStation, HP9000, RS/6000, Sun3, Sparc, Pyramid, Stratus, Unix
- System V 386 machines, VAX, microVAX (VMS) and DOS. Production Systems
- Technologies was founded by Charles Forgy, the original inventor of
- the RETE algorithm. For further information, write to Production
- Systems Technologies, Inc., 5001 Baum Boulevard, Pittsburgh, PA 15213,
- call 412-683-4000 or fax 412-683-6347.
-
-
- Stiquito is a small (3cm H x 7cm W x 6cm L), simple (32 parts) and
- inexpensive (< $30) nitinol-propelled hexapod robot developed at the
- Indiana University (Bloomington) Robotics Laboratory. Its legs are
- propelled by nitnol actuator wires. Each leg has one degree of freedom.
- The robot walks up to 10 centimeters per minute and can carry a 9-volt
- cell, a MOSIS "tiny chip" and power transistors to drive the nitinol
- actuator wires. Nitinol wire (aka BioMetal, Flexinol), is a
- nickel-titanium alloy which exerts useful force as it is heated by
- passing a current through it. IUCS Technical Report 363a describes
- Stiquito's construction and is available by anonymous ftp from
- cs.indiana.edu:/pub (129.79.254.191) in PostScript and Word4 formats as
- the files stiquito.ps.a{a,b,c}.Z and stiquito.w4.a{a,b,c}.Z,
- respectively. The tech report is also available by US mail for $5
- (checks or money orders should be made payable to "Indiana University")
- from Computer Science Department, Attn: TR 363a 215, Lindley Hall,
- Indiana University, Bloomington, Indiana 47405. A kit containing all
- the materials needed to construct a simple version of Stiquito and its
- controller is available for an extra $10 from the above address (use
- attn line "Stiquito Kit"). To receive a video showing the assembly of
- Stiquito, include an additional $10 and add "Video" to the attn line.
- Anyone may build and use Stiquitos in any quantity for educational or
- research purposes, but Indiana University reserves all rights to
- commercial applications. Questions about Stiquito should be sent to
- jwmills@cs.indiana.edu. To join the mailing list, send mail to
- stiquito-request@xcf.berkeley.edu.
-
-
- Togai InfraLogic, Inc. (TIL) is a supplier of fuzzy logic and fuzzy
- expert system software and hardware. For more information, write to
- Togai InfraLogic, Inc., 5 Vanderbilt, Irvine, CA 92718, call +1 714
- 975 8522, fax +1 714 975 8524, or send email to info@til.com or
- til!info. TIL also supports an email-server that can be reached at
- fuzzy-server@til.com or til!fuzzy-server. Send an email message that
- contains just the word "help" in either the subject line or the
- message body for more information. A list of products can be obtained
- by sending a message that contains only the line "send products.txt"
- to the email-server. For an index of the contents of the server, send
- a message with the line "send index".
-
-
- The following is from Risks Digest 13.83 -- I have no idea what the software
- does, but Colby did head up the PARRY project:
-
- FEELING HELPLESS ABOUT DEPRESSION? Overcoming Depression 2.0 provides
- computer based cognitive therapy for depression with therapeutic
- dialogue in everyday language. Created by Kenneth Mark Colby, M.D.,
- Professor of Psychiatry and Biobehavioural Sciences, Emeritus, UCLA.
- Personal Version ($199), Professional version ($499). Malibu
- Artificial Intelligence Works, 25307 Malibu Rd, CA 90265.
- 1-800-497-6889.
-
- ----------------------------------------------------------------
- Subject: [1-9] Glossary of AI terms.
-
- This is the start of a simple glossary of short definitions for AI terminology.
-
- Strong AI:
- Claim that computers can be made to actually think, just like human
- beings do. More precisely, the claim that there exists a class of
- computer programs, such that any implementation of such a program is
- really thinking.
-
- Weak AI:
- Claim that computers are important tools in the modeling and
- simulation of human activity.
-
- Case-based Reasoning:
- Technique whereby "cases" similar to the current problem are
- retrieved and their "solutions" modified to work on the current
- problem.
-
- Nonlinear Planning:
- A planning paradigm which does not enforce a total (linear)
- ordering on the components of a plan.
-